A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio

Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio

Trees are usually drawn planar, i.e. without any edge-crossings. In this paper, we investigate the area requirement of (non-upward) planar straight-line grid drawings of binary trees. Let T be a binary tree with n nodes. We show that T admits a planar straight-line grid drawing with area O(n) and with any pre-specified aspect ratio in the range [n− , n ], where is any constant, such that 0 < < ...

Straight-line Drawings of Binary Trees with Linear Area and Good Aspe t Ratio

Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings

We investigate the problem of drawing an arbitrary n-node binary tree orthogonally in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while also allowing the aspect ratio to be chosen as being O(1) or sometimes even an arbitrary parameter. In addition, we show that one can also achieve an additional desirable aesthetic criterion, which we ...

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

Planar Straight-Line Drawing Algorithms

Luca Vismara — 10.